BED: a Biological Entity Dictionary based on a graph data model
نویسندگان
چکیده
منابع مشابه
BED: a Biological Entity Dictionary based on a graph data model [version 1; referees: 1 approved with reservations]
The understanding of molecular processes involved in a specific biological system can be significantly improved by combining and comparing different data set and knowledge resources. However these information sources often use different identification systems and an identifier conversion step is required before any integration effort. Mapping between identifiers is often provided by the referen...
متن کاملBED: a Biological Entity Dictionary based on a graph data model [version 1; referees: awaiting peer review]
The understanding of molecular processes involved in a specific biological system can be significantly improved by combining and comparing different data set and knowledge resources. However these information sources often use different identification systems and an identifier conversion step is required before any integration effort. Mapping between identifiers is often provided by the referen...
متن کاملa study on insurer solvency by panel data model: the case of iranian insurance market
the aim of this thesis is an approach for assessing insurer’s solvency for iranian insurance companies. we use of economic data with both time series and cross-sectional variation, thus by using the panel data model will survey the insurer solvency.
mortality forecasting based on lee-carter model
over the past decades a number of approaches have been applied for forecasting mortality. in 1992, a new method for long-run forecast of the level and age pattern of mortality was published by lee and carter. this method was welcomed by many authors so it was extended through a wider class of generalized, parametric and nonlinear model. this model represents one of the most influential recent d...
15 صفحه اولLarge vocabulary word recognition based on a graph-structured dictionary
In this paper, a structural search using a word-node graph is proposed to speed up the isolated word recognition based on hidden markov models (HMMs). We de ne a distance measure for comparing pairs of words, and construct a graph keeping the structure of word distribution. Based on this graph, the number of words to be examined are restricted. Experiments show that the search complexity is con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: F1000Research
سال: 2018
ISSN: 2046-1402
DOI: 10.12688/f1000research.13925.3